SemanticLoop: Loop Closure With 3D Semantic Graph Matching
نویسندگان
چکیده
Loop closure can effectively correct the accumulated error in robot localization, which plays a critical role long-term navigation of robot. Traditional appearance-based methods rely on local features and are prone to failure ambiguous environments. On other hand, object recognition infer objects' category, pose, extent. These objects serve as stable semantic landmarks for viewpoint-independent non-ambiguous loop closure. However, there is object-level data association problem due lack efficient robust algorithms. We introduce novel algorithm, incorporates IoU, instance-level embedding, detection uncertainty, formulated linear assignment problem. Then, we model TSDF volumes represent environment 3D graph with semantics topology. Next, propose matching-based based reconstructed graphs by aligning matched objects. Finally, refine poses camera trajectory an pose optimization. Experimental results show that proposed method significantly outperforms commonly used nearest neighbor accuracy. Our more environmental appearance changes than existing methods.
منابع مشابه
Real-Time Large-Scale Dense 3D Reconstruction with Loop Closure
In the highly active research field of dense 3D reconstruction and modelling, loop closure is still a largely unsolved problem. While a number of previous works show how to accumulate keyframes, globally optimize their pose on closure, and compute a dense 3D model as a post-processing step, in this paper we propose an online framework which delivers a consistent 3D model to the user in real tim...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملConceptual Graph Matching for Semantic Search1
Semantic search becomes a research hotspot. The combined use of linguistic ontologies and structured semantic matching is one of the promising ways to improve both recall and precision. In this paper, we propose an approach for semantic search by matching conceptual graphs. The detailed definitions of semantic similarities between concepts, relations and conceptual graphs are given. According t...
متن کاملRobust elastic 2D/3D geometric graph matching
We present an algorithm for geometric matching of graphs embedded in 2D or 3D space. It is applicable for registering any graph-like structures appearing in biomedical images, such as blood vessels, pulmonary bronchi, nerve fibers, or dendritic arbors. Our approach does not rely on the similarity of local appearance features, so it is suitable for multimodal registration with a large difference...
متن کاملGraph-Based Deformable 3D Object Matching
We present a method for efficient detection of deformed 3D objects in 3D point clouds that can handle large amounts of clutter, noise, and occlusion. The method generalizes well to different object classes and does not require an explicit deformation model. Instead, deformations are learned based on a few registered deformed object instances. The approach builds upon graph matching to find corr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE robotics and automation letters
سال: 2023
ISSN: ['2377-3766']
DOI: https://doi.org/10.1109/lra.2022.3229228